Pattern of E-marketplace Customer Shopping Behavior using Tabu Search and FP-Growth Algorithm
نویسندگان
چکیده
منابع مشابه
FP-Growth in Discovery of Customer Patterns
The paper describes a knowledge discovery platform and a novel process for finding association rules based on the algorithm FP-Growth and its variants. Built software solution has been optimized in terms of memory usage and computation time as well as the impact of all modifications made to the whole process of rules discovery The process of rule discovery is illustrated on a real database cont...
متن کاملStrategic Planning Optimization Using Tabu Search Algorithm
In this paper we introduce a method for optimisation of strategic tasks using an approximation algorithm. We propose the mathematical model and algorithm for solving this problem near optimality. An overall motivation for the development of the proposed algorithm is discussed with detailed e ciency analysis. From the end users' perspective the proposed method has practical application because i...
متن کاملOptimal Power Flow Using Tabu Search Algorithm
This paper presents an e cient and reliable tabu search (TS)–based approach to solve the optimal power ow (OPF) problem. The proposed approach employs TS algorithm for optimal settings of the control variables of the OPF problem. Incorporation of TS as a derivative-free optimization technique in solving OPF problem signicantly reduces the computational burden. One of the main advantages of T...
متن کاملGrocery Customer Behavior Analysis using RFID-based Shopping Paths Data
Knowing about the customer behavior in a grocery has been a long-standing issue in the retailing industry. The advent of RFID has made it easier to collect moving data for an individual shopper's behavior. Most of the previous studies used the traditional statistical clustering technique to find the major characteristics of customer behavior, especially shopping path. However, in using the clus...
متن کاملTabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indonesian Journal of Electrical Engineering and Informatics (IJEEI)
سال: 2019
ISSN: 2089-3272,2089-3272
DOI: 10.11591/ijeei.v7i4.1362